61 research outputs found
Branch-and-Reduce Exponential/FPT Algorithms in Practice: A Case Study of Vertex Cover
We investigate the gap between theory and practice for exact branching
algorithms. In theory, branch-and-reduce algorithms currently have the best
time complexity for numerous important problems. On the other hand, in
practice, state-of-the-art methods are based on different approaches, and the
empirical efficiency of such theoretical algorithms have seldom been
investigated probably because they are seemingly inefficient because of the
plethora of complex reduction rules. In this paper, we design a
branch-and-reduce algorithm for the vertex cover problem using the techniques
developed for theoretical algorithms and compare its practical performance with
other state-of-the-art empirical methods. The results indicate that
branch-and-reduce algorithms are actually quite practical and competitive with
other state-of-the-art approaches for several kinds of instances, thus showing
the practical impact of theoretical research on branching algorithms.Comment: To appear in ALENEX 201
Cut Tree Construction from Massive Graphs
The construction of cut trees (also known as Gomory-Hu trees) for a given
graph enables the minimum-cut size of the original graph to be obtained for any
pair of vertices. Cut trees are a powerful back-end for graph management and
mining, as they support various procedures related to the minimum cut, maximum
flow, and connectivity. However, the crucial drawback with cut trees is the
computational cost of their construction. In theory, a cut tree is built by
applying a maximum flow algorithm for times, where is the number of
vertices. Therefore, naive implementations of this approach result in cubic
time complexity, which is obviously too slow for today's large-scale graphs. To
address this issue, in the present study, we propose a new cut-tree
construction algorithm tailored to real-world networks. Using a series of
experiments, we demonstrate that the proposed algorithm is several orders of
magnitude faster than previous algorithms and it can construct cut trees for
billion-scale graphs.Comment: Short version will appear at ICDM'1
Fast Exact Shortest-Path Distance Queries on Large Networks by Pruned Landmark Labeling
We propose a new exact method for shortest-path distance queries on
large-scale networks. Our method precomputes distance labels for vertices by
performing a breadth-first search from every vertex. Seemingly too obvious and
too inefficient at first glance, the key ingredient introduced here is pruning
during breadth-first searches. While we can still answer the correct distance
for any pair of vertices from the labels, it surprisingly reduces the search
space and sizes of labels. Moreover, we show that we can perform 32 or 64
breadth-first searches simultaneously exploiting bitwise operations. We
experimentally demonstrate that the combination of these two techniques is
efficient and robust on various kinds of large-scale real-world networks. In
particular, our method can handle social networks and web graphs with hundreds
of millions of edges, which are two orders of magnitude larger than the limits
of previous exact methods, with comparable query time to those of previous
methods.Comment: To appear in SIGMOD 201
枝刈りラベリング法による大規模グラフ上の体系的なクエリ処理
学位の種別: 課程博士審査委員会委員 : (主査)東京大学教授 小林 直樹, 東京大学教授 萩谷 昌己, 東京大学教授 須田 礼仁, 東京大学准教授 渋谷 哲朗, 東京大学教授 定兼 邦彦, 東京大学教授 岩田 覚University of Tokyo(東京大学
- …